Entanglement-assisted quantum communication beating the quantum Singleton bound
نویسندگان
چکیده
Brun, Devetak, and Hsieh [Science 314, 436 (2006)] demonstrated that preshared entanglement between the sender receiver enables quantum communication protocols have better parameters than schemes without assistance of entanglement. Subsequently, same authors derived a version so-called Singleton bound relates entanglement-assisted quantum-error-correcting codes proposed by them. We present an scheme with violating this in certain ranges. For fixed transmission rate, our allows one to correct larger fraction errors.
منابع مشابه
On subsystem codes beating the quantum Hamming or Singleton bound
Subsystem codes are a generalization of noiseless subsystems, decoherence-free subspaces and stabilizer codes. We generalize the quantum Singleton bound to Fq-linear subsystem codes. It follows that no subsystem code over a prime field can beat the quantum Singleton bound. On the other hand, we show the remarkable fact that there exist impure subsystem codes beating the quantum Hamming bound. A...
متن کاملA Lower Bound on Entanglement-Assisted Quantum Communication Complexity
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed inputs can be turned into a quantum communication protocol. As an application of this bound, we give a very simple proof of the statement that almost all Boo...
متن کاملPlasmon-assisted quantum entanglement
The state of a two-particle system is called entangled when its quantum mechanical wave function cannot be factorized in two singleparticle wave functions. Entanglement leads to the strongest counter-intuitive feature of quantum mechanics, namely nonlocality. Experimental realization of quantum entanglement is relatively easy for the case of photons; a pump photon can spontaneously split into a...
متن کاملEntanglement-Assisted Quantum Convolutional Coding
We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglement-assisted quantum convolutional coding. Our construction produces a Calderbank-Shor-Steane (CSS) entanglement-assisted quantum convolutional code from two arbitrary clas...
متن کاملPreparing the bound instance of quantum entanglement
J. DiGuglielmo, A. Samblowski, B. Hage, C. Pineda, J. Eisert, and R. Schnabel 1 Institut für Gravitationsphysik, Leibniz Universität Hannover, 30167 Hannover, Germany and Max-Planck Institut für Gravitationsphysik, 30167 Hannover, Germany 2 Instituto de Fı́sica, Universidad Nacional Autónoma de México, México 3 Institute of Physics and Astronomy, University of Potsdam, 14476 Potsdam, Germany 4 I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review
سال: 2021
ISSN: ['0556-2813', '1538-4497', '1089-490X']
DOI: https://doi.org/10.1103/physreva.103.l020601